A Recursive Theta Body for Hypergraphs
نویسندگان
چکیده
Abstract The theta body of a graph, introduced by Grötschel, Lovász, and Schrijver (in 1986), is tractable relaxation the independent-set polytope derived from Lovász number. In this paper, we recursively extend body, hence number, to hypergraphs. We obtain fundamental properties extension relate it high-dimensional Hoffman bound Filmus, Golubev, Lifshitz. discuss two applications: triangle-free graphs Mantel’s theorem, bounds on density triangle-avoiding sets in Hamming cube.
منابع مشابه
A real-time recursive dynamic model for vehicle driving simulators
This paper presents the Real-Time Recursive Dynamics (RTRD) model that is developed for driving simulators. The model could be implemented in the Driving Simulator. The RTRD can also be used for off-line high-speed dynamics analysis, compared with commercial multibody dynamics codes, to speed up mechanical design process. An overview of RTRD is presented in the paper. Basic models for specific ...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملA Novel Reference Current Calculation Method for Shunt Active Power Filters using a Recursive Algebraic Approach
This paper presents a novel method to calculate the reference source current and the referencecompensating current for shunt active power filters (SAPFs). This method first calculates theamplitude and phase of the fundamental load current from a recursive algebraic approach blockbefore calculating the displacement power factor. Next, the amplitude of the reference mains currentis computed with ...
متن کاملDirected hypergraphs: A tool for researching digraphs and hypergraphs
In this paper we introduce the concept of directed hypergraph. It is a generalisation of the concept of digraph and is closely related with hypergraphs. The basic idea is to take a hypergraph, partition its edges non-trivially (when possible), and give a total order to such partitions. The elements of these partitions are called levels. In order to preserve the structure of the underlying hyper...
متن کاملRecursive Formulae for the Chromatic Polynomials of Complete r-uniform Mixed Interval Hypergraphs
In response to a problem of Voloshin, we find recursive formulae for the chromatic polyno-mials of complete r-uniform interval hypergraphs and cohypergraphs. We also give recursive formulae for the chromatic polynomials of complete 3-uniform and 4-uniform interval bihy-pergraphs and comment on the challenges for general r. Our method is to exploit the uniform and complete structure of these hyp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2023
ISSN: ['0209-9683', '1439-6912']
DOI: https://doi.org/10.1007/s00493-023-00040-9